国产bbaaaaa片,成年美女黄网站色视频免费,成年黄大片,а天堂中文最新一区二区三区,成人精品视频一区二区三区尤物

首頁> 外文OA文獻(xiàn) >Name creation vs. replication in Petri net systems
【2h】

Name creation vs. replication in Petri net systems

機(jī)譯:Petri網(wǎng)系統(tǒng)中的名稱創(chuàng)建與復(fù)制

摘要

We study the relationship between name creation and replication in a setting of infinite-state communicating automata. By name creation we mean the capacity of dynamically producing pure names, with no relation between them other than equality or inequality. By replication we understand the ability of systems of creating new parallel identical threads, that can synchronize with each other. We have developed our study in the framework of Petri nets, by considering several extensions of P/T nets. In particular, we prove that in this setting name creation and replication are equivalent, but only when a garbage collection mechanism is added for idle threads. However, when simultaneously considering both extensions the obtained model is, a bit surprisingly, Turing complete and therefore, more expressive than when considered separately.
機(jī)譯:我們研究了無限狀態(tài)通信自動(dòng)機(jī)設(shè)置中名稱創(chuàng)建與復(fù)制之間的關(guān)系。通過名稱創(chuàng)建,我們的意思是動(dòng)態(tài)產(chǎn)生純名稱的能力,除了相等或不相等之外,它們之間沒有其他關(guān)系。通過復(fù)制,我們了解系統(tǒng)創(chuàng)建新的并行相同線程的能力,這些線程可以彼此同步。通過考慮P / T網(wǎng)絡(luò)的幾種擴(kuò)展,我們已經(jīng)在Petri網(wǎng)的框架中開展了研究。特別是,我們證明了在此設(shè)置中,名稱的創(chuàng)建和復(fù)制是等效的,但是僅當(dāng)為空閑線程添加了垃圾回收機(jī)制時(shí)。但是,同時(shí)考慮兩個(gè)擴(kuò)展時(shí),所獲得的模型令人驚訝的是,圖靈完整,因此比單獨(dú)考慮時(shí)更具表現(xiàn)力。

著錄項(xiàng)

相似文獻(xiàn)

  • 外文文獻(xiàn)
  • 中文文獻(xiàn)
  • 專利

客服郵箱:kefu@zhangqiaokeyan.com

京公網(wǎng)安備:11010802029741號(hào) ICP備案號(hào):京ICP備15016152號(hào)-6 六維聯(lián)合信息科技 (北京) 有限公司?版權(quán)所有
  • 客服微信

  • 服務(wù)號(hào)